On the Maximum Tolerable Noise of -Input Gates for Reliable Computation by Formulas
نویسندگان
چکیده
We determine the precise threshold of component noise below which formulas composed of odd degree components can reliably compute all Boolean functions.
منابع مشابه
On the maximum tolerable noise of k-input gates for reliable computation by formulas
We determine the precise threshold of component noise below which formulas composed of odd degree components can reliably compute all Boolean functions.
متن کاملOn the Maximum Tolerable Noise for Reliable Computation by Formulas
It is shown that if a formula is constructed from noisy 2-input NAND gates, with each gate failing independently with probability ", then reliable computation can or cannot take place according as " is less than or greater than " 0 = (3? p 7)=4 = 0:08856 : : : .
متن کاملOn the maximum tolerable noise for reliable computation by formulas
It is shown that if formulas constructed from error-prone 3-input gates are used to compute Boolean functions, then a per-gate failure probability of 1/6 or more cannot be tolerated. The result is shown to be tight if the per-gate failure probability is constant and precisely known. Index Tenns -Computation by unreliable components, reliable com-
متن کاملNoise threshold for universality of 2-input gates
Evans and Pippenger showed in 1998 that -noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail independently with probability and < 0 = (3 − √ 7)/4 ≈ 8.856%. We show that formulas built from gates with 2 inputs, in which each gate fails with probability at least 0 cannot be universal. Hence, there is a threshold o...
متن کاملBetter gates can make fault-tolerant computation impossible
We consider fault-tolerant computation with formulas composed of noisy Boolean gates with two input wires. In our model all gates fail independently of each other and of the input. When a gate fails, it outputs the opposite of the correct output. It is known that if all gates fail with probability at least β2 = (3− √ 7)/4 ≈ 8.856%, faulttolerant computation is not possible. On the other hand, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001